Bin packing problem - PDFSEARCH.IO - Document Search Engine

Bin packing problem
Results: 81

#	Item
61	Optimizing Web Traffic via the Media Scheduling Problem Lars Backstrom∗ Jon Kleinberg† Ravi Kumar Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-04-13 16:23:35 Applied mathematics Bin packing problem Dynamic programming Function Big O notation Clickthrough rate Scheduling Mathematical optimization Mathematics Operations research Mathematical analysis
62	A Genetic Algorithm for the Two-Dimensional Knapsack Problem with Rectangular Pieces Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Combinatorial optimization Operations research Packaging Bin packing problem Genetic algorithm Packing problem Knapsack problem Heuristic Mathematical optimization Theoretical computer science Mathematics Applied mathematics
63	A Tree Search Algorithm for Solving the Container Loading Problem Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Discrete geometry NP-complete problems Packaging Packing problem BL1 Box Knapsack problem Bin packing problem Cuboid Mathematics Theoretical computer science Geometry
64	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
65	Chapter 4: Deterministic Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Operations research Linear programming Combinatorial optimization Linear programming relaxation Relaxation Bin packing problem Approximation algorithm Mathematical optimization Theoretical computer science Applied mathematics
66	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:04 Approximation algorithm Computational complexity theory Bin packing problem Summation Theoretical computer science Mathematics Applied mathematics
67	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
68	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:04
69	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
70	Asymptopia CENTRE FOR MATHEMATICAL SCIENCES NEWSLETTER September[removed]It’s Officially Open Add to Reading List Source URL: www.maths.cam.ac.uk Language: English - Date: 2010-03-29 09:15:24 Education Millennium Mathematics Project Teleconferencing Operations research Applied mathematics Bin packing problem Richard R. Weber Packing problem Faculty of Mathematics University of Cambridge Mathematics Mathematics education Theoretical computer science

UPDATE